Blar i NTNU Open på forfatter "Pan, Jiaxin"

Viser treff 1-20 av 30

    • A Memory-Tight Reduction for the Twin Hashed ElGamal 

      Juvik, Ross (Master thesis, 2022)
      I denne oppgaven ser vi på minnetetthet som en betingelse for sikkerhet i reduksjonsbaserte sikkerhetsbeviser. Minneeffektivitet er en viktig kompleksitetsparameter for black-box-reduksjoner når det aktuelle kryptografiske ...

    • Authenticated Key Exchange and Signatures with Tight Security in the Standard Model 

      Han, Shuai; Jager, Tibor; Kiltz, Eike; Liu, Shengli; Pan, Jiaxin; Riepel, Doreen; Schäge, Sven (Peer reviewed; Journal article, 2021)
      We construct the first authenticated key exchange protocols that achieve tight security in the standard model. Previous works either relied on techniques that seem to inherently require a random oracle, or achieved only ...

    • Backward-Leak Uni-Directional Updatable Encryption from (Homomorphic) Public Key Encryption 

      Galteland, Yao Jiang; Pan, Jiaxin (Peer reviewed; Journal article, 2023)
      The understanding of directionality for updatable encryption (UE) schemes is important, but not yet completed in the literature. We show that security in the backward-leak uni-directional key updates setting is equivalent ...

    • Bidirectional Ratcheted Key Exchange Using Broadcasting 

      Eggen Svandal, Amund (Master thesis, 2023)
      We expand the definition of ratcheted key exchange given by Bellare, Singh, Jaeger, Nyayapati, and Stepanovs to allow bidirectional communication using broadcasting. We give a concrete scheme for ratcheted key exchange ...

    • Chopsticks: Fork-Free Two-Round Multi-signatures from Non-interactive Assumptions 

      Pan, Jiaxin; Wagner, Benedikt (Peer reviewed; Journal article, 2023)
      Multi-signatures have been drawing lots of attention in recent years, due to their applications in cryptocurrencies. Most early constructions require three-round signing, and recent constructions have managed to reduce the ...

    • Compact and Tightly Selective-Opening Secure Public-key Encryption Schemes 

      Pan, Jiaxin; Zeng, Runzhi (Peer reviewed; Journal article, 2022)
      We propose four public-key encryption schemes with tight simulation-based selective-opening security against chosen-ciphertext attacks (SIM-SO-CCA) in the random oracle model. Our schemes only consist of small constant ...

    • Compact Structure-Preserving Signatures with Almost Tight Security 

      Abe, Masayuki; Hofheinz, Dennis; Nishimaki, Ryo; Ohkubo, Miyako; Pan, Jiaxin (Peer reviewed; Journal article, 2023)
      In structure-preserving cryptography, every building block shares the same bilinear groups. These groups must be generated for a specific, a priori fixed security level, and thus, it is vital that the security reduction ...

    • Fine-Grained Secure Attribute-Based Encryption 

      Wang, Yuyu; Pan, Jiaxin; Chen, Yu (Peer reviewed; Journal article, 2021)

    • Functional Encryption for Inner Product Functionality 

      Heggen, Vilde Haugsbakken (Master thesis, 2022)
      Denne oppgaven inneholder konstruksjon av funksjonelle krypteringsalgoritmer for mindre generelle funksjoneller, men som enda er uttrykksfulle nok for praktiske scenarier. Oppgaven er avgrenset til å kun bruke indre produkt ...

    • A Generic Construction of Tightly Secure Password-Based Authenticated Key Exchange 

      Pan, Jiaxin; Zeng, Runzhi (Peer reviewed; Journal article, 2023)
      We propose a generic construction of password-based authenticated key exchange (PAKE) from key encapsulation mechanisms (KEM). Assuming that the KEM is oneway secure against plaintext-checkable attacks (OW-PCA), we prove ...

    • Generic constructions of master-key KDM secure attribute-based encryption 

      Pan, Jiaxin; Qian, Chen; Wagner, Benedikt (Peer reviewed; Journal article, 2023)
      Master-key key-dependent message (mKDM) security is a strong security notion for attribute-based encryption (ABE) schemes, which has been investigated in recent years. This line of research was started with identity-based ...

    • Hierarchical Identity-Based Encryption with Tight Multi-challenge Security 

      Langrehr, Roman; Pan, Jiaxin (Peer reviewed; Journal article, 2020)
      We construct the first hierarchical identity-based encryption (HIBE) scheme with tight adaptive security in the multi-challenge setting, where adversaries are allowed to ask for ciphertexts for multiple adaptively chosen ...

    • Implementing Lattice-Based Cryptography 

      Rodríguez Rodríguez, Alejandro Royher (Bachelor thesis, 2022)
      The thesis is about implementation of LWE/MLWE encryption schemes in C++ and the use of the Number Theoretic Transform (NTT) in order to get faster mul- tiplication operations over certain rings. We explore how much speed ...

    • Lattice-Based Authenticated Key Exchange with Tight Security 

      Pan, Jiaxin; Wagner, Benedikt; Zeng, Runzhi (Peer reviewed; Journal article, 2023)
      We construct the first tightly secure authenticated key exchange (AKE) protocol from lattices. Known tight constructions are all based on Diffie-Hellman-like assumptions. Thus, our protocol is the first construction with ...

    • Lattice-Based Signatures with Tight Adaptive Corruptions and More 

      Pan, Jiaxin; Wagner, Benedikt (Peer reviewed; Journal article, 2022)
      We construct the first tightly secure signature schemes in the multi-user setting with adaptive corruptions from lattices. In stark contrast to the previous tight constructions whose security is solely based on number-theoretic ...

    • Multi-user CDH Problems and the Concrete Security of NAXOS and HMQV 

      Kiltz, Eike; Pan, Jiaxin; Riepel, Doreen; Ringerud, Magnus Dotset (Peer reviewed; Journal article, 2023)

    • Multi-user security for Schnorr-like signature schemes 

      Sund, Espen (Bachelor thesis, 2022)
      I denne oppgaven skal jeg først ta for meg et sikkerhetsbevis for Schnorr-signaturalgoritmen. Beviset inneholder flere steg der vi begynner med Schnorrs identifikasjonsprotokoll som er basert på vanskeligheten ved å løse ...

    • Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security 

      Wang, Yuyu; Pan, Jiaxin (Peer reviewed; Journal article, 2022)
      We construct the first non-interactive zero-knowledge (NIZK) proof systems in the fine-grained setting where adversaries’ resources are bounded and honest users have no more resources than an adversary. More concretely, ...

    • On the Multi-Challenge Security of the Fujisaki-Okamoto Transformation 

      Saugestad, Margrete (Master thesis, 2022)
      Abstract will be available on 2025-02-24

    • Provable Security of Authenticated Encryption Schemes 

      Engan, Sunniva (Bachelor thesis, 2022)
      Denne bacheloroppgaven ser på den bevisbare sikkerheten til randomized counter mode (RCM) og Galois counter mode (GCM). Dette gjøres ved å bruke sekvenser av spill for å strukturere bevisene. Vi vil bevise at randomized ...